Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
نویسندگان
چکیده
In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains uch as distributed sensor networks, disaster rescue, hospital scheduling and others. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem, explaining the different sources of difficulties, and a formal explanation of the strengths and limitations of key approaches is missing. We take a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem. We define four categories of difficulties of the problem. To address this formalized problem, the paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DDCSP). The central contribution of the paper is a generalized mapping from distributed resource allocation to DDCSE This mapping is proven to correctly perform resource allocation problems of specific difficulty. This theoretical result is verified in practice by an implementation a real-world distributed sensor network.
منابع مشابه
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general so...
متن کاملDistributed Resource Allocation: Formalization, Complexity Results and Mappings to Distributed CSPs
In distributed resource allocation a set of agents must assign their resources to a set of dynamic tasks. This problem arises in many real-world domains like the one described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general solution strategy are missing. Such forma...
متن کاملTarget Tracking in Sensor Networks: A Distributed Constraint Satisfaction Approach
In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed sensor networks, disaster rescue, hospital scheduling and others. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem, explaining the different sources of difficu...
متن کاملResource Allocation in Sensor Networks Using Distributed Constraint Optimization
Several algorithms have been proposed for solving constraint satisfaction and the more general constraint optimization problem in a distributed manner. In this paper we apply two such algorithms to the task of dynamic resource allocation in the sensor network domain using appropriate abstractions. The aim is to effectively track multiple targets by making the sensors coordinate with each other ...
متن کاملDistributed Constraint Satisfaction and the Bounds on Resource Allocation in Wireless Networks
In this paper we consider medium access scheduling in ad hoc networks as a distributed constraint satisfaction problem (DCSP), and present experimental results on the solvability and complexity of this problem. We show that there are “phase transitions” in solvability and complexity with respect to the transmission power of the wireless nodes. The phase transition curves indicate that there is ...
متن کامل